On the efficient decoding of algebraic-geometric codes
نویسنده
چکیده
This talk is intended to give a survey on the existing literature on the decoding of algebraic-geometric codes. Although the motivation originally was to find an efficient decoding algorithm for algebraic-geometric codes, the latest results give algorithms which can be explained purely in terms of linear algebra. We will treat the following subjects: 1. The decoding problem 2. Decoding by error location 3. Decoding by error location of algebraic-geometric codes 4. Majority coset decoding 5. Decoding algebraic-geometric codes by solving the key equation 6. Improvements of the complexity ∗Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands
منابع مشابه
Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance from the received vector, where can be greater than the error-correction bound. In [18], a list-decoding procedure for Reed–Solomon codes [19] was generalized to algebraic–geometric codes. A recent work [8] gives improved list decodings for Reed–Solomon codes and alg...
متن کاملA Displacement Structure Approach to List Decoding of Reed-Solomon and Algebraic-Geometric Codes∗
Using the method of displacement we shall develop a unified framework for derivation of efficient list decoding algorithms for algebraic-geometric codes. We will demonstrate our method by accelerating Sudan’s list decoding algorithm for Reed-Solomon codes [22], its generalization to algebraicgeometric codes by Shokrollahi and Wasserman [21], and the recent improvement of Guruswami and Sudan [8]...
متن کاملAlgebraic-geometric generalizations of the Parvaresh-Vardy codes
This paper is concerned with a new family of error-correcting codes based on algebraic curves over finite fields, and list decoding algorithms for them. The basic goal in the subject of list decoding is to construct error-correcting codes C over some alphabet Σ which have good rate R, and at the same every Hamming ball of (relative) radius p has few codewords of C, and moreover these codewords ...
متن کاملOptimal rate algebraic list decoding using narrow ray class fields
We use class field theory, specifically Drinfeld modules of rank 1, to construct a family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. Over a field of size l, these codes are within 2/( √ l − 1) of the Singleton bound. The functions fields underlying these codes are subfields with a cyclic Galois group of the narrow ray class field of certain function fields. The ...
متن کاملOptimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets
We construct a new list-decodable family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. The function fields underlying these codes are constructed using class field theory, specifically Drinfeld modules of rank 1, and designed to have an automorphism of large order that is used to “fold” the AG code. This generalizes earlier work by the first author on folded AG cod...
متن کامل